<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>Navo Portable Library: navo/algorithm/nonlinear/binary/splaylnk.c源文件</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body onload='searchBox.OnSelectItem(0);'>
<!-- 制作者 Doxygen 1.7.3 -->
<script type="text/javascript"><!--
var searchBox = new SearchBox("searchBox", "search",false,'搜索');
--></script>
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">Navo Portable Library&#160;<span id="projectnumber">Ver 1.0.20120827</span></div>
   <div id="projectbrief">Provides generic platform independent facilities.</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>首页</span></a></li>
      <li><a href="modules.html"><span>模块</span></a></li>
      <li><a href="annotated.html"><span>数据结构</span></a></li>
      <li class="current"><a href="files.html"><span>文件</span></a></li>
      <li id="searchli">
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="搜索" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>文件列表</span></a></li>
      <li><a href="globals.html"><span>全局定义</span></a></li>
    </ul>
  </div>
<div class="header">
  <div class="headertitle">
<h1>navo/algorithm/nonlinear/binary/splaylnk.c</h1>  </div>
</div>
<div class="contents">
<a href="splaylnk_8c.html">浏览该文件的文档。</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */</span>
<a name="l00011"></a>00011 <span class="preprocessor">#include &quot;<a class="code" href="splaylnk_8h.html" title="Splay linked tree.">splaylnk.h</a>&quot;</span>
<a name="l00012"></a>00012 
<a name="l00013"></a>00013 <span class="preprocessor">#ifdef _MSC_VER</span>
<a name="l00014"></a>00014 <span class="preprocessor"></span><span class="preprocessor">#pragma optimize(&quot;t&quot;, on)</span>
<a name="l00015"></a>00015 <span class="preprocessor"></span><span class="preprocessor">#endif  </span><span class="comment">/* #ifdef _MSC_VER */</span>
<a name="l00016"></a>00016 
<a name="l00017"></a>00017 <span class="preprocessor">#ifdef __cplusplus</span>
<a name="l00018"></a>00018 <span class="preprocessor"></span><span class="keyword">extern</span> <span class="stringliteral">&quot;C&quot;</span> {
<a name="l00019"></a>00019 <span class="preprocessor">#endif </span><span class="comment">/* #ifdef __cplusplus */</span>
<a name="l00020"></a>00020 
<a name="l00021"></a>00021 <span class="keyword">static</span> <span class="keyword">inline</span> splaylnk_link_left(<a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> parent, <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> child)
<a name="l00022"></a>00022 {
<a name="l00023"></a>00023     parent-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a> = child;
<a name="l00024"></a>00024     <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga0bc6c60eab55d8b1ff543b3bbd430277" title="仅在node不为空时，设置node的父节点">splaylnk_set_parent_if</a>(child, parent);
<a name="l00025"></a>00025 }
<a name="l00026"></a>00026 
<a name="l00027"></a>00027 <span class="keyword">static</span> <span class="keyword">inline</span> splaylnk_link_right(<a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> parent, <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> child)
<a name="l00028"></a>00028 {
<a name="l00029"></a>00029     parent-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a> = child;
<a name="l00030"></a>00030     <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga0bc6c60eab55d8b1ff543b3bbd430277" title="仅在node不为空时，设置node的父节点">splaylnk_set_parent_if</a>(child, parent);
<a name="l00031"></a>00031 }
<a name="l00032"></a>00032 
<a name="l00033"></a>00033 <span class="keyword">static</span> <span class="keyword">inline</span> splaylnk_link_left_unsafe(<a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> parent, 
<a name="l00034"></a>00034                                         <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> child)
<a name="l00035"></a>00035 {
<a name="l00036"></a>00036     parent-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a> = child;
<a name="l00037"></a>00037     child-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a> = parent;
<a name="l00038"></a>00038 }
<a name="l00039"></a>00039 
<a name="l00040"></a>00040 <span class="keyword">static</span> <span class="keyword">inline</span> splaylnk_link_right_unsafe(<a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> parent, 
<a name="l00041"></a>00041                                          <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> child)
<a name="l00042"></a>00042 {
<a name="l00043"></a>00043     parent-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a> = child;
<a name="l00044"></a>00044     child-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a> = parent;
<a name="l00045"></a>00045 }
<a name="l00046"></a>00046 
<a name="l00047"></a>00047 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> splaylnk_replace_child(<a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root, 
<a name="l00048"></a>00048     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> me, <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> old_child, <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> new_child)
<a name="l00049"></a>00049 {
<a name="l00050"></a>00050     <span class="keywordflow">if</span> (me) {
<a name="l00051"></a>00051         <span class="keywordflow">if</span> (old_child == me-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>)
<a name="l00052"></a>00052             me-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a> = new_child;
<a name="l00053"></a>00053         <span class="keywordflow">else</span>
<a name="l00054"></a>00054             me-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a> = new_child;
<a name="l00055"></a>00055     } <span class="keywordflow">else</span>
<a name="l00056"></a>00056         root-&gt;<a class="code" href="structsplaylnk__root.html#ad1a7b82ff33bd008821a73024d7c3576" title="根节点">node</a> = new_child;
<a name="l00057"></a>00057 }
<a name="l00058"></a>00058 
<a name="l00059"></a>00059 <span class="comment">/* 对top节点进行zig左旋转 */</span>
<a name="l00060"></a>00060 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> splaylnk_zig_rotate_left(<a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* top, 
<a name="l00061"></a>00061                                             <a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root)
<a name="l00062"></a>00062 {
<a name="l00063"></a>00063     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* parent = top-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a>;
<a name="l00064"></a>00064     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* node = top-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>;
<a name="l00065"></a>00065     splaylnk_link_right(top, node-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>);
<a name="l00066"></a>00066     splaylnk_link_left_unsafe(node, top);
<a name="l00067"></a>00067     splaylnk_replace_child(root, parent, top, node);
<a name="l00068"></a>00068     node-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a> = parent;
<a name="l00069"></a>00069 }
<a name="l00070"></a>00070 
<a name="l00071"></a>00071 <span class="comment">/* 对top节点进行zig右旋转 */</span>
<a name="l00072"></a>00072 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> splaylnk_zig_rotate_right(<a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* top, 
<a name="l00073"></a>00073                                             <a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root)
<a name="l00074"></a>00074 {
<a name="l00075"></a>00075     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* parent = top-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a>;
<a name="l00076"></a>00076     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* node = top-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>;
<a name="l00077"></a>00077     splaylnk_link_left(top, node-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>);
<a name="l00078"></a>00078     splaylnk_link_right_unsafe(node, top);
<a name="l00079"></a>00079     splaylnk_replace_child(root, parent, top, node);
<a name="l00080"></a>00080     node-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a> = parent;
<a name="l00081"></a>00081 }
<a name="l00082"></a>00082 
<a name="l00083"></a>00083 <span class="comment">/* 对top节点进行zigzig左旋转 */</span>
<a name="l00084"></a>00084 <span class="keyword">static</span> <span class="keywordtype">void</span> splaylnk_zigzig_rotate_left(<a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* gparent, 
<a name="l00085"></a>00085     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* parent, <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* node, <a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root)
<a name="l00086"></a>00086 {
<a name="l00087"></a>00087     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> ggparent = gparent-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a>;
<a name="l00088"></a>00088     splaylnk_link_right(gparent, parent-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>);
<a name="l00089"></a>00089     splaylnk_link_right(parent, node-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>);
<a name="l00090"></a>00090     splaylnk_link_left_unsafe(parent, gparent);
<a name="l00091"></a>00091     splaylnk_link_left_unsafe(node, parent);
<a name="l00092"></a>00092     splaylnk_replace_child(root, ggparent, gparent, node);
<a name="l00093"></a>00093     node-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a> = ggparent;
<a name="l00094"></a>00094 }
<a name="l00095"></a>00095 
<a name="l00096"></a>00096 <span class="comment">/* 对top节点进行zigzig右旋转 */</span>
<a name="l00097"></a>00097 <span class="keyword">static</span> <span class="keywordtype">void</span> splaylnk_zigzig_rotate_right(<a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* gparent, 
<a name="l00098"></a>00098     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* parent, <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* node, <a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root)
<a name="l00099"></a>00099 {
<a name="l00100"></a>00100     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> ggparent = gparent-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a>;
<a name="l00101"></a>00101     splaylnk_link_left(gparent, parent-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>);
<a name="l00102"></a>00102     splaylnk_link_left(parent, node-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>);
<a name="l00103"></a>00103     splaylnk_link_right_unsafe(parent, gparent);
<a name="l00104"></a>00104     splaylnk_link_right_unsafe(node, parent);
<a name="l00105"></a>00105     splaylnk_replace_child(root, ggparent, gparent, node);
<a name="l00106"></a>00106     node-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a> = ggparent;
<a name="l00107"></a>00107 }
<a name="l00108"></a>00108 
<a name="l00109"></a>00109 <span class="comment">/* 对top节点进行v左旋转 */</span>
<a name="l00110"></a>00110 <span class="keyword">static</span> <span class="keywordtype">void</span> splaylnk_zigzag_rotate_left(<a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* gparent, 
<a name="l00111"></a>00111     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* parent, <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* node, <a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root)
<a name="l00112"></a>00112 {
<a name="l00113"></a>00113     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> ggparent = gparent-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a>;
<a name="l00114"></a>00114     splaylnk_link_right(gparent, node-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>);
<a name="l00115"></a>00115     splaylnk_link_left(parent, node-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>);
<a name="l00116"></a>00116     splaylnk_link_left_unsafe(node, gparent);
<a name="l00117"></a>00117     splaylnk_link_right_unsafe(node, parent);
<a name="l00118"></a>00118     splaylnk_replace_child(root, ggparent, gparent, node);
<a name="l00119"></a>00119     node-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a> = ggparent;
<a name="l00120"></a>00120 }
<a name="l00121"></a>00121 
<a name="l00122"></a>00122 <span class="comment">/* 对top节点进行zigzag右旋转 */</span>
<a name="l00123"></a>00123 <span class="keyword">static</span> <span class="keywordtype">void</span> splaylnk_zigzag_rotate_right(<a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* gparent, 
<a name="l00124"></a>00124     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* parent, <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* node, <a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root)
<a name="l00125"></a>00125 {
<a name="l00126"></a>00126     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> ggparent = gparent-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a>;
<a name="l00127"></a>00127     splaylnk_link_left(gparent, node-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>);
<a name="l00128"></a>00128     splaylnk_link_right(parent, node-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>);
<a name="l00129"></a>00129     splaylnk_link_right_unsafe(node, gparent);
<a name="l00130"></a>00130     splaylnk_link_left_unsafe(node, parent);
<a name="l00131"></a>00131     splaylnk_replace_child(root, ggparent, gparent, node);
<a name="l00132"></a>00132     node-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a> = ggparent;
<a name="l00133"></a>00133 }
<a name="l00134"></a>00134 
<a name="l00135"></a><a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gada68906d6a788a0c39d67127f037e875">00135</a> NV_IMPL <span class="keywordtype">void</span> <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gada68906d6a788a0c39d67127f037e875" title="对节点进行伸展调整">splaylnk_splay</a>(<a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root, <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* node, 
<a name="l00136"></a>00136                                 <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* parent)
<a name="l00137"></a>00137 {
<a name="l00138"></a>00138     <span class="keywordflow">while</span> (parent) {
<a name="l00139"></a>00139         <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> gparent = parent-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a>;
<a name="l00140"></a>00140         <span class="keywordflow">if</span> (node == parent-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>) {
<a name="l00141"></a>00141             <span class="keywordflow">if</span> (!gparent) {
<a name="l00142"></a>00142                 <span class="comment">/* 如果父节点是根节点，直接进行单旋 */</span>
<a name="l00143"></a>00143                 splaylnk_zig_rotate_right(parent, root);
<a name="l00144"></a>00144             } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (parent == gparent-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>) {
<a name="l00145"></a>00145                 <span class="comment">/* 如果父节点是祖父节点的左子且node是父节点的左子，</span>
<a name="l00146"></a>00146 <span class="comment">                 * 则&#39;一&#39;字形旋转</span>
<a name="l00147"></a>00147 <span class="comment">                 */</span>
<a name="l00148"></a>00148                 splaylnk_zigzig_rotate_right(gparent, parent, node, root);
<a name="l00149"></a>00149             } <span class="keywordflow">else</span> {
<a name="l00150"></a>00150                 <span class="comment">/* 如果父节点是祖父节点的左子且node是父节点的右子，</span>
<a name="l00151"></a>00151 <span class="comment">                 * 则&#39;之&#39;字形旋转</span>
<a name="l00152"></a>00152 <span class="comment">                 */</span>
<a name="l00153"></a>00153                 splaylnk_zigzag_rotate_left(gparent, parent, node, root);
<a name="l00154"></a>00154             }
<a name="l00155"></a>00155             parent = node-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a>;
<a name="l00156"></a>00156         } <span class="keywordflow">else</span> {
<a name="l00157"></a>00157             <span class="keywordflow">if</span> (!gparent) {
<a name="l00158"></a>00158                 <span class="comment">/* 如果父节点是根节点，直接进行单旋 */</span>
<a name="l00159"></a>00159                 splaylnk_zig_rotate_left(parent, root);
<a name="l00160"></a>00160             } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (parent == gparent-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>) {
<a name="l00161"></a>00161                 <span class="comment">/* 如果父节点是祖父节点的右子且node是父节点的右子，</span>
<a name="l00162"></a>00162 <span class="comment">                 * 则&#39;一&#39;字形旋转</span>
<a name="l00163"></a>00163 <span class="comment">                 */</span>
<a name="l00164"></a>00164                 splaylnk_zigzig_rotate_left(gparent, parent, node, root);
<a name="l00165"></a>00165             } <span class="keywordflow">else</span> {
<a name="l00166"></a>00166                 <span class="comment">/* 如果父节点是祖父节点的右子且node是父节点的左子，</span>
<a name="l00167"></a>00167 <span class="comment">                 * 则&#39;之&#39;字形旋转</span>
<a name="l00168"></a>00168 <span class="comment">                 */</span>
<a name="l00169"></a>00169                 splaylnk_zigzag_rotate_right(gparent, parent, node, root);
<a name="l00170"></a>00170             }
<a name="l00171"></a>00171             parent = node-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a>;
<a name="l00172"></a>00172         }
<a name="l00173"></a>00173     }
<a name="l00174"></a>00174 }
<a name="l00175"></a>00175 
<a name="l00176"></a><a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gaaa0524284fb74c268dde8f245219f34f">00176</a> NV_IMPL <span class="keywordtype">void</span> <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gaaa0524284fb74c268dde8f245219f34f" title="对节点进行半伸展调整">splaylnk_semisplay</a>(<a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root, <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* node, 
<a name="l00177"></a>00177                                     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* parent)
<a name="l00178"></a>00178 {
<a name="l00179"></a>00179     <span class="keywordflow">while</span> (parent) {
<a name="l00180"></a>00180         <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> gparent = parent-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a>;
<a name="l00181"></a>00181         <span class="keywordflow">if</span> (node == parent-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>) {
<a name="l00182"></a>00182             <span class="keywordflow">if</span> (!gparent || (parent == gparent-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>)) {
<a name="l00183"></a>00183                 <span class="comment">/* （1）如果父节点是根节点，直接进行单旋,</span>
<a name="l00184"></a>00184 <span class="comment">                 * （2）如果父节点是祖父节点的左子且node是父节点的左子，</span>
<a name="l00185"></a>00185 <span class="comment">                 * 直接对父节点进行右旋（或左旋）</span>
<a name="l00186"></a>00186 <span class="comment">                 */</span>
<a name="l00187"></a>00187                 splaylnk_zig_rotate_right(parent, root);
<a name="l00188"></a>00188             } <span class="keywordflow">else</span> {
<a name="l00189"></a>00189                 <span class="comment">/* 如果父节点是祖父节点的左子且node是父节点的右子，</span>
<a name="l00190"></a>00190 <span class="comment">                 * 则&#39;之&#39;字形旋转</span>
<a name="l00191"></a>00191 <span class="comment">                 */</span>
<a name="l00192"></a>00192                 splaylnk_zigzag_rotate_left(gparent, parent, node, root);
<a name="l00193"></a>00193             }
<a name="l00194"></a>00194             parent = node-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a>;
<a name="l00195"></a>00195         } <span class="keywordflow">else</span> {
<a name="l00196"></a>00196             <span class="keywordflow">if</span> (!gparent || (parent == gparent-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>)) {
<a name="l00197"></a>00197                 <span class="comment">/* （1）如果父节点是根节点，直接进行单旋,</span>
<a name="l00198"></a>00198 <span class="comment">                 * （2）如果父节点是祖父节点的右子且node是父节点的右子，</span>
<a name="l00199"></a>00199 <span class="comment">                 * 直接对父节点进行左旋</span>
<a name="l00200"></a>00200 <span class="comment">                 */</span>
<a name="l00201"></a>00201                 splaylnk_zig_rotate_left(parent, root);
<a name="l00202"></a>00202             } <span class="keywordflow">else</span> {
<a name="l00203"></a>00203                 <span class="comment">/* 如果父节点是祖父节点的右子且node是父节点的左子，</span>
<a name="l00204"></a>00204 <span class="comment">                 * 则&#39;之&#39;字形旋转</span>
<a name="l00205"></a>00205 <span class="comment">                 */</span>
<a name="l00206"></a>00206                 splaylnk_zigzag_rotate_right(gparent, parent, node, root);
<a name="l00207"></a>00207             }
<a name="l00208"></a>00208             parent = node-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a>;
<a name="l00209"></a>00209         }
<a name="l00210"></a>00210     }
<a name="l00211"></a>00211 }
<a name="l00212"></a>00212 
<a name="l00213"></a><a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga5a5a89278bf4369487a3fbd73fa76f3f">00213</a> NV_IMPL <span class="keywordtype">void</span> <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga5a5a89278bf4369487a3fbd73fa76f3f" title="移除某个节点(伸展)">splaylnk_erase</a>(<a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root, <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* entry)
<a name="l00214"></a>00214 {
<a name="l00215"></a>00215     <span class="comment">/* 把待删除节点伸展到树根 */</span>
<a name="l00216"></a>00216     <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gada68906d6a788a0c39d67127f037e875" title="对节点进行伸展调整">splaylnk_splay</a>(root, entry, entry-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a>);
<a name="l00217"></a>00217     <span class="keywordflow">do</span> {
<a name="l00218"></a>00218         <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> child;
<a name="l00219"></a>00219         <span class="comment">/* 如果entry节点最多只有一个孩子，则直接删除entry节点，</span>
<a name="l00220"></a>00220 <span class="comment">         * 如果entry同时有两个孩子，需要将其转换成只有一子或无子的情况</span>
<a name="l00221"></a>00221 <span class="comment">         */</span>
<a name="l00222"></a>00222         <span class="keywordflow">if</span> (!entry-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>)
<a name="l00223"></a>00223             child = entry-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>;
<a name="l00224"></a>00224         <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!entry-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>)
<a name="l00225"></a>00225             child = entry-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>;
<a name="l00226"></a>00226         <span class="keywordflow">else</span> {
<a name="l00227"></a>00227             <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> left = entry-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>;
<a name="l00228"></a>00228             <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> right = entry-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>;
<a name="l00229"></a>00229             <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> node = left;
<a name="l00230"></a>00230             <span class="comment">/* 把树分割成左子树和右子树 */</span>
<a name="l00231"></a>00231             left-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a> = NULL;
<a name="l00232"></a>00232             right-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a> = NULL;
<a name="l00233"></a>00233             <span class="comment">/* 将左子树最右节点伸展到左子树树根，将其代替entry树根 */</span>
<a name="l00234"></a>00234             <span class="keywordflow">while</span> (node-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>)
<a name="l00235"></a>00235                 node = node-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>;
<a name="l00236"></a>00236             <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gada68906d6a788a0c39d67127f037e875" title="对节点进行伸展调整">splaylnk_splay</a>(root, node, node-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a>);
<a name="l00237"></a>00237             <span class="comment">/* 重新合并左子树和右子树 */</span>
<a name="l00238"></a>00238             right = entry-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>;
<a name="l00239"></a>00239             node-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a> = right;
<a name="l00240"></a>00240             right-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a> = node;
<a name="l00241"></a>00241             <span class="comment">/* 完成伸展 */</span>
<a name="l00242"></a>00242             <span class="keywordflow">break</span>;
<a name="l00243"></a>00243         }
<a name="l00244"></a>00244         <span class="comment">/* 接上面的if和else if，删除entry节点 */</span>
<a name="l00245"></a>00245         <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga0bc6c60eab55d8b1ff543b3bbd430277" title="仅在node不为空时，设置node的父节点">splaylnk_set_parent_if</a>(child, NULL);
<a name="l00246"></a>00246         root-&gt;<a class="code" href="structsplaylnk__root.html#ad1a7b82ff33bd008821a73024d7c3576" title="根节点">node</a> = child;
<a name="l00247"></a>00247     } <span class="keywordflow">while</span> (0);
<a name="l00248"></a>00248 }
<a name="l00249"></a>00249 
<a name="l00250"></a><a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga967ec8dd9063af617b682ea2760f1829">00250</a> NV_IMPL <span class="keywordtype">void</span> <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga967ec8dd9063af617b682ea2760f1829" title="移除某个节点(半伸展)">splaylnk_semierase</a>(<a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root, <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_node</a>* entry)
<a name="l00251"></a>00251 {
<a name="l00252"></a>00252     <span class="comment">/* 把待删除节点伸展到树根 */</span>
<a name="l00253"></a>00253     <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gaaa0524284fb74c268dde8f245219f34f" title="对节点进行半伸展调整">splaylnk_semisplay</a>(root, entry, entry-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a>);
<a name="l00254"></a>00254     <span class="keywordflow">do</span> {
<a name="l00255"></a>00255         <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> child;
<a name="l00256"></a>00256         <span class="comment">/* 如果entry节点最多只有一个孩子，则直接删除entry节点，</span>
<a name="l00257"></a>00257 <span class="comment">         * 如果entry同时有两个孩子，需要将其转换成只有一子或无子的情况</span>
<a name="l00258"></a>00258 <span class="comment">         */</span>
<a name="l00259"></a>00259         <span class="keywordflow">if</span> (!entry-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>)
<a name="l00260"></a>00260             child = entry-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>;
<a name="l00261"></a>00261         <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!entry-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>)
<a name="l00262"></a>00262             child = entry-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>;
<a name="l00263"></a>00263         <span class="keywordflow">else</span> {
<a name="l00264"></a>00264             <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> left = entry-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>;
<a name="l00265"></a>00265             <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> right = entry-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>;
<a name="l00266"></a>00266             <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> node = left;
<a name="l00267"></a>00267             <span class="comment">/* 把树分割成左子树和右子树 */</span>
<a name="l00268"></a>00268             left-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a> = NULL;
<a name="l00269"></a>00269             <span class="comment">/* 将左子树最右节点伸展到左子树树根，将其代替entry树根 */</span>
<a name="l00270"></a>00270             <span class="keywordflow">while</span> (node-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>)
<a name="l00271"></a>00271                 node = node-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>;
<a name="l00272"></a>00272             <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gaaa0524284fb74c268dde8f245219f34f" title="对节点进行半伸展调整">splaylnk_semisplay</a>(root, node, node-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a>);
<a name="l00273"></a>00273             <span class="comment">/* 重新合并左子树和右子树 */</span>
<a name="l00274"></a>00274             right = entry-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>;
<a name="l00275"></a>00275             node-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a> = right;
<a name="l00276"></a>00276             right-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a> = node;
<a name="l00277"></a>00277             <span class="comment">/* 完成伸展 */</span>
<a name="l00278"></a>00278             <span class="keywordflow">break</span>;
<a name="l00279"></a>00279         }
<a name="l00280"></a>00280         <span class="comment">/* 接上面的if和else if，删除entry节点 */</span>
<a name="l00281"></a>00281         <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga0bc6c60eab55d8b1ff543b3bbd430277" title="仅在node不为空时，设置node的父节点">splaylnk_set_parent_if</a>(child, NULL);
<a name="l00282"></a>00282         root-&gt;<a class="code" href="structsplaylnk__root.html#ad1a7b82ff33bd008821a73024d7c3576" title="根节点">node</a> = child;
<a name="l00283"></a>00283     } <span class="keywordflow">while</span> (0);
<a name="l00284"></a>00284 }
<a name="l00285"></a>00285 
<a name="l00286"></a><a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gaf8b8aa25afe97aafae97b716b29ef460">00286</a> NV_IMPL <span class="keywordtype">void</span> <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gaf8b8aa25afe97aafae97b716b29ef460" title="移除区域内的节点(伸展)">splaylnk_erases</a>(<a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root, <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> begin, 
<a name="l00287"></a>00287                                 <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> end, <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gac07a47df24523e66c8f37863d68b3d59" title="单参数回调函数指针">splaylnk_pr1</a> erase_handler)
<a name="l00288"></a>00288 {
<a name="l00289"></a>00289     <span class="keywordflow">if</span> (erase_handler) {
<a name="l00290"></a>00290         <span class="keywordflow">while</span> (begin != end) {
<a name="l00291"></a>00291             <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> cur = begin;
<a name="l00292"></a>00292             <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga6cfeb8883fb82004328680139dfbd127" title="迭代器递增">splaylnk_inc</a>(begin);
<a name="l00293"></a>00293             <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga5a5a89278bf4369487a3fbd73fa76f3f" title="移除某个节点(伸展)">splaylnk_erase</a>(root, cur);
<a name="l00294"></a>00294             erase_handler(cur);
<a name="l00295"></a>00295         }
<a name="l00296"></a>00296 
<a name="l00297"></a>00297     } <span class="keywordflow">else</span> {
<a name="l00298"></a>00298         <span class="keywordflow">while</span> (begin != end)
<a name="l00299"></a>00299             <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga5a5a89278bf4369487a3fbd73fa76f3f" title="移除某个节点(伸展)">splaylnk_erase</a>(root, <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga2ccc72af8c152a19ede061ea516805bc" title="迭代器后自增">splaylnk_inc_later</a>(begin));
<a name="l00300"></a>00300     }
<a name="l00301"></a>00301 }
<a name="l00302"></a>00302 
<a name="l00303"></a><a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gaabe47843d251d2e8d3d9560e163af0ef">00303</a> NV_IMPL <span class="keywordtype">void</span> <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gaabe47843d251d2e8d3d9560e163af0ef" title="移除区域内的节点(半伸展)">splaylnk_semierases</a>(<a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root, <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> begin, 
<a name="l00304"></a>00304                                     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> end, <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gac07a47df24523e66c8f37863d68b3d59" title="单参数回调函数指针">splaylnk_pr1</a> erase_handler)
<a name="l00305"></a>00305 {
<a name="l00306"></a>00306     <span class="keywordflow">if</span> (erase_handler) {
<a name="l00307"></a>00307         <span class="keywordflow">while</span> (begin != end) {
<a name="l00308"></a>00308             <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> cur = begin;
<a name="l00309"></a>00309             <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga6cfeb8883fb82004328680139dfbd127" title="迭代器递增">splaylnk_inc</a>(begin);
<a name="l00310"></a>00310             <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga967ec8dd9063af617b682ea2760f1829" title="移除某个节点(半伸展)">splaylnk_semierase</a>(root, cur);
<a name="l00311"></a>00311             erase_handler(cur);
<a name="l00312"></a>00312         }
<a name="l00313"></a>00313 
<a name="l00314"></a>00314     } <span class="keywordflow">else</span> {
<a name="l00315"></a>00315         <span class="keywordflow">while</span> (begin != end)
<a name="l00316"></a>00316             <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga967ec8dd9063af617b682ea2760f1829" title="移除某个节点(半伸展)">splaylnk_semierase</a>(root, <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga2ccc72af8c152a19ede061ea516805bc" title="迭代器后自增">splaylnk_inc_later</a>(begin));
<a name="l00317"></a>00317     }
<a name="l00318"></a>00318 }
<a name="l00319"></a>00319 
<a name="l00320"></a><a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga270dd16e098a16b9631eb0a8f712ffb4">00320</a> NV_IMPL <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga270dd16e098a16b9631eb0a8f712ffb4" title="给迭代器增加一段距离或减小一段距离">splaylnk_advance</a>(<a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> cur, <span class="keywordtype">int</span> dist)
<a name="l00321"></a>00321 {
<a name="l00322"></a>00322     <span class="keywordflow">if</span> (dist &gt; 0) {
<a name="l00323"></a>00323         <span class="keywordflow">while</span> (cur &amp;&amp; dist--)
<a name="l00324"></a>00324             <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga6cfeb8883fb82004328680139dfbd127" title="迭代器递增">splaylnk_inc</a>(cur);
<a name="l00325"></a>00325     } <span class="keywordflow">else</span> {
<a name="l00326"></a>00326         <span class="keywordflow">while</span> (cur &amp;&amp; dist++)
<a name="l00327"></a>00327             <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga116d136bf37eb1a0ffb58157e3c06f23" title="迭代器递减">splaylnk_dec</a>(cur);
<a name="l00328"></a>00328     }
<a name="l00329"></a>00329     <span class="keywordflow">return</span> cur;
<a name="l00330"></a>00330 }
<a name="l00331"></a>00331 
<a name="l00332"></a><a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gaa1f8902531ce41d20ed3fd88d6f8de69">00332</a> NV_IMPL <span class="keywordtype">int</span> <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gaa1f8902531ce41d20ed3fd88d6f8de69" title="判断一个节点是否存在于树中">splaylnk_exist</a>(<a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root, <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> itr)
<a name="l00333"></a>00333 {
<a name="l00334"></a>00334     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> i = <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga4ea94db03f94aba84fb246f474a87df4" title="得到树的最左端节点">splaylnk_front</a>(root);
<a name="l00335"></a>00335     
<a name="l00336"></a>00336     <span class="keywordflow">while</span> (i) {
<a name="l00337"></a>00337         <span class="keywordflow">if</span> (i == itr)
<a name="l00338"></a>00338             <span class="keywordflow">return</span> 1;
<a name="l00339"></a>00339         <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga6cfeb8883fb82004328680139dfbd127" title="迭代器递增">splaylnk_inc</a>(i);
<a name="l00340"></a>00340     }
<a name="l00341"></a>00341     
<a name="l00342"></a>00342     <span class="keywordflow">return</span> 0;
<a name="l00343"></a>00343 }
<a name="l00344"></a>00344 
<a name="l00345"></a><a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga4ea94db03f94aba84fb246f474a87df4">00345</a> NV_IMPL <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga4ea94db03f94aba84fb246f474a87df4" title="得到树的最左端节点">splaylnk_front</a>(<a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root)
<a name="l00346"></a>00346 {
<a name="l00347"></a>00347     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> i = root-&gt;<a class="code" href="structsplaylnk__root.html#ad1a7b82ff33bd008821a73024d7c3576" title="根节点">node</a>;
<a name="l00348"></a>00348 
<a name="l00349"></a>00349     <span class="keywordflow">if</span> (!i)
<a name="l00350"></a>00350         <span class="keywordflow">return</span> NULL;
<a name="l00351"></a>00351 
<a name="l00352"></a>00352     <span class="comment">/* 一直往左边走，找到最左边的节点 */</span>
<a name="l00353"></a>00353     <span class="keywordflow">while</span> (i-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>)
<a name="l00354"></a>00354         i = i-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>;
<a name="l00355"></a>00355 
<a name="l00356"></a>00356     <span class="keywordflow">return</span> i;
<a name="l00357"></a>00357 }
<a name="l00358"></a>00358 
<a name="l00359"></a><a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gab9dc4ef36e511ad52d1f16c167b1facd">00359</a> NV_IMPL <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gab9dc4ef36e511ad52d1f16c167b1facd" title="得到树的最右端节点">splaylnk_back</a>(<a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root)
<a name="l00360"></a>00360 {
<a name="l00361"></a>00361     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> i = root-&gt;<a class="code" href="structsplaylnk__root.html#ad1a7b82ff33bd008821a73024d7c3576" title="根节点">node</a>;
<a name="l00362"></a>00362     
<a name="l00363"></a>00363     <span class="keywordflow">if</span> (!i)
<a name="l00364"></a>00364         <span class="keywordflow">return</span> NULL;
<a name="l00365"></a>00365     
<a name="l00366"></a>00366     <span class="comment">/* 一直往右边走，找到最右边的节点 */</span>
<a name="l00367"></a>00367     <span class="keywordflow">while</span> (i-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>)
<a name="l00368"></a>00368         i = i-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>;
<a name="l00369"></a>00369     
<a name="l00370"></a>00370     <span class="keywordflow">return</span> i;
<a name="l00371"></a>00371 }
<a name="l00372"></a>00372 
<a name="l00373"></a><a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga6fc0567f0310442cab65da24be50f6c6">00373</a> NV_IMPL <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga6fc0567f0310442cab65da24be50f6c6" title="得到当前节点的中序后继节点">splaylnk_next</a>(<a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> cur)
<a name="l00374"></a>00374 {
<a name="l00375"></a>00375     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> parent;
<a name="l00376"></a>00376     
<a name="l00377"></a>00377     <span class="comment">/* 如果有右孩子，往右边走 */</span>
<a name="l00378"></a>00378     <span class="keywordflow">if</span> (cur-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>) {
<a name="l00379"></a>00379         cur = cur-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>;
<a name="l00380"></a>00380         <span class="comment">/* 找右孩子下最靠左的节点 */</span>
<a name="l00381"></a>00381         <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>)
<a name="l00382"></a>00382             cur = cur-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>;
<a name="l00383"></a>00383         <span class="keywordflow">return</span> cur;
<a name="l00384"></a>00384     }
<a name="l00385"></a>00385     <span class="comment">/* 如果没有右孩子，向父节点走 */</span>
<a name="l00386"></a>00386     <span class="keywordflow">while</span> ((parent = <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga59c8e5d7719e7d97ef4d7b15ac31a4ff" title="得到父节点">splaylnk_parent</a>(cur)) 
<a name="l00387"></a>00387             &amp;&amp; cur == parent-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>)
<a name="l00388"></a>00388         cur = parent;
<a name="l00389"></a>00389     
<a name="l00390"></a>00390     <span class="keywordflow">return</span> parent;
<a name="l00391"></a>00391 }
<a name="l00392"></a>00392 
<a name="l00393"></a><a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga31c7ab1c0c602384c51537bc8c36cc4b">00393</a> NV_IMPL <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga31c7ab1c0c602384c51537bc8c36cc4b" title="得到当前节点的中序前驱节点">splaylnk_prev</a>(<a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> cur)
<a name="l00394"></a>00394 {
<a name="l00395"></a>00395     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> parent;
<a name="l00396"></a>00396 
<a name="l00397"></a>00397     <span class="comment">/* 如果有左孩子，往左边走 */</span>
<a name="l00398"></a>00398     <span class="keywordflow">if</span> (cur-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>) {
<a name="l00399"></a>00399         cur = cur-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>;
<a name="l00400"></a>00400         <span class="comment">/* 找左孩子下最靠右的节点 */</span>
<a name="l00401"></a>00401         <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>)
<a name="l00402"></a>00402             cur = cur-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>;
<a name="l00403"></a>00403         <span class="keywordflow">return</span> cur;
<a name="l00404"></a>00404     }
<a name="l00405"></a>00405     <span class="comment">/* 如果没有左孩子，向父节点走 */</span>
<a name="l00406"></a>00406     <span class="keywordflow">while</span> ((parent = <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga59c8e5d7719e7d97ef4d7b15ac31a4ff" title="得到父节点">splaylnk_parent</a>(cur)) 
<a name="l00407"></a>00407             &amp;&amp; cur == parent-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>)
<a name="l00408"></a>00408         cur = parent;
<a name="l00409"></a>00409 
<a name="l00410"></a>00410     <span class="keywordflow">return</span> parent;
<a name="l00411"></a>00411 }
<a name="l00412"></a>00412 
<a name="l00413"></a><a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gab8d130bbc63ec59e932b631666893aeb">00413</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gab8d130bbc63ec59e932b631666893aeb" title="计算树的深度">splaylnk_depth</a>(<a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root)
<a name="l00414"></a>00414 {
<a name="l00415"></a>00415     <span class="keywordtype">size_t</span> cur_depth;
<a name="l00416"></a>00416     <span class="keywordtype">size_t</span> max_depth = 0;
<a name="l00417"></a>00417     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> parent;
<a name="l00418"></a>00418     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> cur = root-&gt;<a class="code" href="structsplaylnk__root.html#ad1a7b82ff33bd008821a73024d7c3576" title="根节点">node</a>;
<a name="l00419"></a>00419     
<a name="l00420"></a>00420     <span class="keywordflow">if</span> (cur) {
<a name="l00421"></a>00421         cur_depth = 1;
<a name="l00422"></a>00422         <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>) {
<a name="l00423"></a>00423             cur = cur-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>;
<a name="l00424"></a>00424             ++cur_depth;
<a name="l00425"></a>00425         }
<a name="l00426"></a>00426         max_depth = cur_depth;
<a name="l00427"></a>00427         <span class="keywordflow">do</span> {<span class="comment">/* 如果有右孩子，往右边走 */</span>
<a name="l00428"></a>00428             <span class="keywordflow">if</span> (cur-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>) {
<a name="l00429"></a>00429                 cur = cur-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>;
<a name="l00430"></a>00430                 ++cur_depth;
<a name="l00431"></a>00431                 <span class="comment">/* 找右孩子下最靠左的节点 */</span>
<a name="l00432"></a>00432                 <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>) {
<a name="l00433"></a>00433                     cur = cur-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>;
<a name="l00434"></a>00434                     ++cur_depth;
<a name="l00435"></a>00435                 }
<a name="l00436"></a>00436                 <span class="keywordflow">if</span> (cur_depth &gt; max_depth)
<a name="l00437"></a>00437                     max_depth = cur_depth;
<a name="l00438"></a>00438             } <span class="keywordflow">else</span> {
<a name="l00439"></a>00439                 <span class="comment">/* 如果没有右孩子，向父节点走 */</span>
<a name="l00440"></a>00440                 <span class="keywordflow">while</span> ((parent = <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga59c8e5d7719e7d97ef4d7b15ac31a4ff" title="得到父节点">splaylnk_parent</a>(cur)) 
<a name="l00441"></a>00441                         &amp;&amp; cur == parent-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>) {
<a name="l00442"></a>00442                     cur = parent;
<a name="l00443"></a>00443                     --cur_depth;
<a name="l00444"></a>00444                 }
<a name="l00445"></a>00445                 cur = parent;
<a name="l00446"></a>00446                 --cur_depth;
<a name="l00447"></a>00447             }
<a name="l00448"></a>00448         } <span class="keywordflow">while</span> (cur);
<a name="l00449"></a>00449     }
<a name="l00450"></a>00450     
<a name="l00451"></a>00451     <span class="keywordflow">return</span> max_depth;
<a name="l00452"></a>00452 }
<a name="l00453"></a>00453 
<a name="l00454"></a><a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gad3e72453d2045135cb2f4ea45e170ebf">00454</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gad3e72453d2045135cb2f4ea45e170ebf" title="计算树的叶子数">splaylnk_leafs</a>(<a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root)
<a name="l00455"></a>00455 {
<a name="l00456"></a>00456     <span class="keywordtype">size_t</span> leafs = 0;
<a name="l00457"></a>00457     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> parent;
<a name="l00458"></a>00458     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> cur = <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga2e0c221b5e448b08815f57083ab7f88d" title="得到指向正向起始位置的迭代器">splaylnk_begin</a>(root);
<a name="l00459"></a>00459     
<a name="l00460"></a>00460     <span class="keywordflow">while</span> (cur) {
<a name="l00461"></a>00461         <span class="comment">/* 如果有右孩子，往右边走 */</span>
<a name="l00462"></a>00462         <span class="keywordflow">if</span> (cur-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>) {
<a name="l00463"></a>00463             cur = cur-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>;
<a name="l00464"></a>00464             <span class="comment">/* 找右孩子下最靠左的节点 */</span>
<a name="l00465"></a>00465             <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>)
<a name="l00466"></a>00466                 cur = cur-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>;
<a name="l00467"></a>00467         } <span class="keywordflow">else</span> {
<a name="l00468"></a>00468             <span class="keywordflow">if</span> (!cur-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>)
<a name="l00469"></a>00469                 ++leafs;
<a name="l00470"></a>00470             <span class="comment">/* 如果没有右孩子，向父节点走 */</span>
<a name="l00471"></a>00471             <span class="keywordflow">while</span> ((parent = <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga59c8e5d7719e7d97ef4d7b15ac31a4ff" title="得到父节点">splaylnk_parent</a>(cur)) 
<a name="l00472"></a>00472                     &amp;&amp; cur == parent-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>)
<a name="l00473"></a>00473                 cur = parent;
<a name="l00474"></a>00474             cur = parent;
<a name="l00475"></a>00475         }
<a name="l00476"></a>00476     }
<a name="l00477"></a>00477     
<a name="l00478"></a>00478     <span class="keywordflow">return</span> leafs;
<a name="l00479"></a>00479 }
<a name="l00480"></a>00480 
<a name="l00481"></a><a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga047a6df159da0ec6e9b865a81cdbd2ad">00481</a> NV_IMPL <span class="keywordtype">void</span> <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga047a6df159da0ec6e9b865a81cdbd2ad" title="获取树的信息，包括节点数、深度、叶子数">splaylnk_get_info</a>(<a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root, <a class="code" href="structsplaylnk__info.html" title="树信息表">splaylnk_info</a>* info)
<a name="l00482"></a>00482 {
<a name="l00483"></a>00483     <span class="keywordtype">size_t</span> cnt = 0;
<a name="l00484"></a>00484     <span class="keywordtype">size_t</span> leafs = 0;
<a name="l00485"></a>00485     <span class="keywordtype">size_t</span> cur_depth;
<a name="l00486"></a>00486     <span class="keywordtype">size_t</span> max_depth = 0;
<a name="l00487"></a>00487     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> parent;
<a name="l00488"></a>00488     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> cur = root-&gt;<a class="code" href="structsplaylnk__root.html#ad1a7b82ff33bd008821a73024d7c3576" title="根节点">node</a>;
<a name="l00489"></a>00489     
<a name="l00490"></a>00490     <span class="keywordflow">if</span> (cur) {
<a name="l00491"></a>00491         cur_depth = 1;
<a name="l00492"></a>00492         <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>) {
<a name="l00493"></a>00493             cur = cur-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>;
<a name="l00494"></a>00494             ++cur_depth;
<a name="l00495"></a>00495         }
<a name="l00496"></a>00496         max_depth = cur_depth;
<a name="l00497"></a>00497         <span class="keywordflow">do</span> {
<a name="l00498"></a>00498             ++cnt;
<a name="l00499"></a>00499             <span class="comment">/* 如果有右孩子，往右边走 */</span>
<a name="l00500"></a>00500             <span class="keywordflow">if</span> (cur-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>) {
<a name="l00501"></a>00501                 cur = cur-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>;
<a name="l00502"></a>00502                 ++cur_depth;
<a name="l00503"></a>00503                 <span class="comment">/* 找右孩子下最靠左的节点 */</span>
<a name="l00504"></a>00504                 <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>) {
<a name="l00505"></a>00505                     cur = cur-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>;
<a name="l00506"></a>00506                     ++cur_depth;
<a name="l00507"></a>00507                 }
<a name="l00508"></a>00508                 <span class="keywordflow">if</span> (cur_depth &gt; max_depth)
<a name="l00509"></a>00509                     max_depth = cur_depth;
<a name="l00510"></a>00510             } <span class="keywordflow">else</span> {
<a name="l00511"></a>00511                 <span class="keywordflow">if</span> (!cur-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>)
<a name="l00512"></a>00512                     ++leafs;
<a name="l00513"></a>00513                 <span class="comment">/* 如果没有右孩子，向父节点走 */</span>
<a name="l00514"></a>00514                 <span class="keywordflow">while</span> ((parent = <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga59c8e5d7719e7d97ef4d7b15ac31a4ff" title="得到父节点">splaylnk_parent</a>(cur)) 
<a name="l00515"></a>00515                         &amp;&amp; cur == parent-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>) {
<a name="l00516"></a>00516                     cur = parent;
<a name="l00517"></a>00517                     --cur_depth;
<a name="l00518"></a>00518                 }
<a name="l00519"></a>00519                 cur = parent;
<a name="l00520"></a>00520                 --cur_depth;
<a name="l00521"></a>00521             }
<a name="l00522"></a>00522         } <span class="keywordflow">while</span> (cur);
<a name="l00523"></a>00523     }
<a name="l00524"></a>00524     
<a name="l00525"></a>00525     info-&gt;<a class="code" href="structsplaylnk__info.html#a76d971a3c552bc58ba9f0d5fceae9806" title="节点数">count</a> = cnt;
<a name="l00526"></a>00526     info-&gt;<a class="code" href="structsplaylnk__info.html#a820c167ceaaa9759b0ca2695d22db55c" title="深度">depth</a> = max_depth;
<a name="l00527"></a>00527     info-&gt;<a class="code" href="structsplaylnk__info.html#a62f3b2ad4f6c6147d1bb9a71dd8c9656" title="叶子数">leafs</a> = leafs;
<a name="l00528"></a>00528 }
<a name="l00529"></a>00529 
<a name="l00530"></a><a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga96a0390c48c3efce2bfcc0d8e169d02c">00530</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga96a0390c48c3efce2bfcc0d8e169d02c" title="获取树的节点总数">splaylnk_count</a>(<a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root)
<a name="l00531"></a>00531 {
<a name="l00532"></a>00532     <span class="keywordtype">size_t</span> cnt = 0;
<a name="l00533"></a>00533     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> i = <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga2e0c221b5e448b08815f57083ab7f88d" title="得到指向正向起始位置的迭代器">splaylnk_begin</a>(root);
<a name="l00534"></a>00534 
<a name="l00535"></a>00535     <span class="keywordflow">while</span> (i) {
<a name="l00536"></a>00536         <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga6cfeb8883fb82004328680139dfbd127" title="迭代器递增">splaylnk_inc</a>(i);
<a name="l00537"></a>00537         ++cnt;
<a name="l00538"></a>00538     }
<a name="l00539"></a>00539 
<a name="l00540"></a>00540     <span class="keywordflow">return</span> cnt;
<a name="l00541"></a>00541 }
<a name="l00542"></a>00542 
<a name="l00543"></a><a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga184ab3bc7e5856c525fa69b1c0894dc7">00543</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga184ab3bc7e5856c525fa69b1c0894dc7" title="计算两个节点的迭代距离">splaylnk_distance</a>(<a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> first, <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> last)
<a name="l00544"></a>00544 {
<a name="l00545"></a>00545     <span class="keywordtype">size_t</span> dist = 1;
<a name="l00546"></a>00546     
<a name="l00547"></a>00547     <span class="keywordflow">while</span> (first != last) {
<a name="l00548"></a>00548         <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga6cfeb8883fb82004328680139dfbd127" title="迭代器递增">splaylnk_inc</a>(first);
<a name="l00549"></a>00549         ++dist;
<a name="l00550"></a>00550     }
<a name="l00551"></a>00551     
<a name="l00552"></a>00552     <span class="keywordflow">return</span> dist;
<a name="l00553"></a>00553 }
<a name="l00554"></a>00554 
<a name="l00555"></a><a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga54bf3a666d7d44370c76f84ebb016dfa">00555</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga54bf3a666d7d44370c76f84ebb016dfa" title="计算迭代器的正向索引">splaylnk_index_of</a>(<a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root, <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> itr)
<a name="l00556"></a>00556 {
<a name="l00557"></a>00557     <span class="keywordtype">size_t</span> cnt = 0;
<a name="l00558"></a>00558     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> i = <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga2e0c221b5e448b08815f57083ab7f88d" title="得到指向正向起始位置的迭代器">splaylnk_begin</a>(root);
<a name="l00559"></a>00559     
<a name="l00560"></a>00560     <span class="keywordflow">while</span> (i &amp;&amp; i != itr) {
<a name="l00561"></a>00561         <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga6cfeb8883fb82004328680139dfbd127" title="迭代器递增">splaylnk_inc</a>(i);
<a name="l00562"></a>00562         ++cnt;
<a name="l00563"></a>00563     }
<a name="l00564"></a>00564     
<a name="l00565"></a>00565     <span class="keywordflow">return</span> cnt;
<a name="l00566"></a>00566 }
<a name="l00567"></a>00567 
<a name="l00568"></a><a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gab24b1de0094f3caac4b04b22ecc9006e">00568</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gab24b1de0094f3caac4b04b22ecc9006e" title="计算迭代器的逆向索引">splaylnk_reverse_index_of</a>(<a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root, 
<a name="l00569"></a>00569                                                 <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> itr)
<a name="l00570"></a>00570 {
<a name="l00571"></a>00571     <span class="keywordtype">size_t</span> cnt = 0;
<a name="l00572"></a>00572     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> i = <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gab60f4495e69b5698230fd1e6f4f655ec" title="得到指向逆向起始位置的迭代器">splaylnk_rbegin</a>(root);
<a name="l00573"></a>00573     
<a name="l00574"></a>00574     <span class="keywordflow">while</span> (i &amp;&amp; i != itr) {
<a name="l00575"></a>00575         <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga116d136bf37eb1a0ffb58157e3c06f23" title="迭代器递减">splaylnk_dec</a>(i);
<a name="l00576"></a>00576         ++cnt;
<a name="l00577"></a>00577     }
<a name="l00578"></a>00578     
<a name="l00579"></a>00579     <span class="keywordflow">return</span> cnt;
<a name="l00580"></a>00580 }
<a name="l00581"></a>00581 
<a name="l00582"></a>00582 NV_IMPL <span class="keywordtype">void</span> __do_splaylnk_recurse_foreach(<a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> cur, 
<a name="l00583"></a>00583                                 <span class="keywordtype">void</span> (*fn)(<span class="keywordtype">void</span>*), <span class="keywordtype">size_t</span> offset)
<a name="l00584"></a>00584 {
<a name="l00585"></a>00585     <span class="keywordflow">if</span> (cur) {
<a name="l00586"></a>00586         __do_splaylnk_recurse_foreach(cur-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>, fn, offset);
<a name="l00587"></a>00587         fn(((<span class="keywordtype">char</span>*)cur) - offset);
<a name="l00588"></a>00588         __do_splaylnk_recurse_foreach(cur-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>, fn, offset);
<a name="l00589"></a>00589     }
<a name="l00590"></a>00590 }
<a name="l00591"></a>00591 
<a name="l00592"></a>00592 NV_IMPL <span class="keywordtype">void</span> __do_splaylnk_recurse_reverse_foreach(
<a name="l00593"></a>00593                         <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> cur, <span class="keywordtype">void</span> (*fn)(<span class="keywordtype">void</span>*), <span class="keywordtype">size_t</span> offset)
<a name="l00594"></a>00594 {
<a name="l00595"></a>00595     <span class="keywordflow">if</span> (cur) {
<a name="l00596"></a>00596         __do_splaylnk_recurse_reverse_foreach(cur-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a>, fn, offset);
<a name="l00597"></a>00597         fn(((<span class="keywordtype">char</span>*)cur) - offset);
<a name="l00598"></a>00598         __do_splaylnk_recurse_reverse_foreach(cur-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a>, fn, offset);
<a name="l00599"></a>00599     }
<a name="l00600"></a>00600 }
<a name="l00601"></a>00601 
<a name="l00602"></a>00602 NV_IMPL <span class="keywordtype">void</span> __splaylnk_serialize(<a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root, 
<a name="l00603"></a>00603                                     <span class="keywordtype">void</span>** buf, <span class="keywordtype">size_t</span> offset)
<a name="l00604"></a>00604 {
<a name="l00605"></a>00605     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> i = <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga2e0c221b5e448b08815f57083ab7f88d" title="得到指向正向起始位置的迭代器">splaylnk_begin</a>(root);
<a name="l00606"></a>00606 
<a name="l00607"></a>00607     <span class="keywordflow">while</span> (i) {
<a name="l00608"></a>00608         <span class="keywordtype">void</span>* p = ((<span class="keywordtype">char</span>*)i) - offset;
<a name="l00609"></a>00609         *buf++ = p;
<a name="l00610"></a>00610         <a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#ga6cfeb8883fb82004328680139dfbd127" title="迭代器递增">splaylnk_inc</a>(i);
<a name="l00611"></a>00611     }
<a name="l00612"></a>00612 }
<a name="l00613"></a>00613 
<a name="l00614"></a>00614 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">size_t</span> SPLAYLNK_F(<span class="keywordtype">size_t</span> i, <span class="keywordtype">size_t</span> resv)
<a name="l00615"></a>00615 {
<a name="l00616"></a>00616     <span class="keywordflow">if</span> (i + 1 &gt;= resv)
<a name="l00617"></a>00617         <span class="keywordflow">return</span> i + resv;
<a name="l00618"></a>00618     <span class="keywordflow">return</span> (i &lt;&lt; 1) + 1;
<a name="l00619"></a>00619 }
<a name="l00620"></a>00620 
<a name="l00621"></a>00621 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">size_t</span> SPLAYLNK_P(<span class="keywordtype">size_t</span> i, <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> b)
<a name="l00622"></a>00622 {
<a name="l00623"></a>00623     <span class="keywordflow">return</span> ((i &gt;&gt; d) &lt;&lt; d) + b;
<a name="l00624"></a>00624 }
<a name="l00625"></a>00625 
<a name="l00626"></a>00626 NV_IMPL <span class="keywordtype">void</span> __splaylnk_deserialize(<a class="code" href="structsplaylnk__root.html" title="树根">splaylnk_root</a>* root, <span class="keywordtype">char</span>** buf, 
<a name="l00627"></a>00627                                         <span class="keywordtype">size_t</span> cnt, <span class="keywordtype">size_t</span> offset)
<a name="l00628"></a>00628 {
<a name="l00629"></a>00629     <a class="code" href="struct____splaylnk__node.html" title="伸展树节点">splaylnk_iter</a> pi, pj, pp;
<a name="l00630"></a>00630     <span class="keywordtype">size_t</span> i, r, h, c, t, s, d, lv;
<a name="l00631"></a>00631     <span class="keywordflow">if</span> (!cnt) {
<a name="l00632"></a>00632         root-&gt;<a class="code" href="structsplaylnk__root.html#ad1a7b82ff33bd008821a73024d7c3576" title="根节点">node</a> = NULL;
<a name="l00633"></a>00633         <span class="keywordflow">return</span>;
<a name="l00634"></a>00634     } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (cnt == 1) {
<a name="l00635"></a>00635         pp = (<a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gad419d6203da790205c3ced27085c87ad" title="迭代器">splaylnk_iter</a>)((*buf) + offset);
<a name="l00636"></a>00636         root-&gt;<a class="code" href="structsplaylnk__root.html#ad1a7b82ff33bd008821a73024d7c3576" title="根节点">node</a> = pp;
<a name="l00637"></a>00637         pp-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a> = NULL;
<a name="l00638"></a>00638         <span class="keywordflow">return</span>;
<a name="l00639"></a>00639     }
<a name="l00640"></a>00640     h = 0; c = 1; lv = 0;
<a name="l00641"></a>00641     s = 1; d = 2; t = cnt;
<a name="l00642"></a>00642     <span class="keywordflow">while</span> (t &gt;&gt;= 1) {
<a name="l00643"></a>00643         ++lv;
<a name="l00644"></a>00644         c &lt;&lt;= 1;
<a name="l00645"></a>00645     }
<a name="l00646"></a>00646     r = cnt - (--c);
<a name="l00647"></a>00647     <span class="keywordflow">while</span> (++h &lt; lv) {
<a name="l00648"></a>00648         i = s - 1;
<a name="l00649"></a>00649         s &lt;&lt;= 1;
<a name="l00650"></a>00650         <span class="keywordflow">while</span> (i &lt; c) {
<a name="l00651"></a>00651             <span class="keywordtype">size_t</span> p = SPLAYLNK_P(i, h + 1, s - 1);
<a name="l00652"></a>00652             pp = (<a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gad419d6203da790205c3ced27085c87ad" title="迭代器">splaylnk_iter</a>)
<a name="l00653"></a>00653                 (buf[SPLAYLNK_F(p, r)] + offset);
<a name="l00654"></a>00654             pi = (<a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gad419d6203da790205c3ced27085c87ad" title="迭代器">splaylnk_iter</a>)
<a name="l00655"></a>00655                 (buf[SPLAYLNK_F(i, r)] + offset);
<a name="l00656"></a>00656             splaylnk_link_left_unsafe(pp, pi);
<a name="l00657"></a>00657             i += d;
<a name="l00658"></a>00658             pj = (<a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gad419d6203da790205c3ced27085c87ad" title="迭代器">splaylnk_iter</a>)
<a name="l00659"></a>00659                 (buf[SPLAYLNK_F(i, r)] + offset);
<a name="l00660"></a>00660             splaylnk_link_right_unsafe(pp, pj);
<a name="l00661"></a>00661             <span class="keywordflow">if</span> (h &lt; 2) {
<a name="l00662"></a>00662                 pi-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a> = NULL;
<a name="l00663"></a>00663                 pi-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a> = NULL;
<a name="l00664"></a>00664                 pj-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a> = NULL;
<a name="l00665"></a>00665                 pj-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a> = NULL;
<a name="l00666"></a>00666             }
<a name="l00667"></a>00667             i += d;
<a name="l00668"></a>00668         }
<a name="l00669"></a>00669         d &lt;&lt;= 1;
<a name="l00670"></a>00670     }
<a name="l00671"></a>00671     root-&gt;<a class="code" href="structsplaylnk__root.html#ad1a7b82ff33bd008821a73024d7c3576" title="根节点">node</a> = pp;
<a name="l00672"></a>00672     pp-&gt;<a class="code" href="struct____splaylnk__node.html#a1b8aa83724dda5b481330b8ca569cdc0" title="父节点">parent</a> = NULL;
<a name="l00673"></a>00673     <span class="keywordflow">for</span> (i = 0; i &lt; r; ++i) {
<a name="l00674"></a>00674         pp = (<a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gad419d6203da790205c3ced27085c87ad" title="迭代器">splaylnk_iter</a>)
<a name="l00675"></a>00675             (buf[((i &gt;&gt; 1) &lt;&lt; 2) + 1] + offset);
<a name="l00676"></a>00676         pi = (<a class="code" href="group___xE4_xBC_xB8_xE5_xB1_x95_xE6_xA0_x91.html#gad419d6203da790205c3ced27085c87ad" title="迭代器">splaylnk_iter</a>)
<a name="l00677"></a>00677             (buf[i &lt;&lt; 1] + offset);
<a name="l00678"></a>00678         pi-&gt;<a class="code" href="struct____splaylnk__node.html#aa0ed7aab4acf06a006c61aa96e4cd5a1" title="左子节点">left</a> = NULL;
<a name="l00679"></a>00679         pi-&gt;<a class="code" href="struct____splaylnk__node.html#adbcf818bcfba554a383e453874ad29a4" title="右子节点">right</a> = NULL;
<a name="l00680"></a>00680         <span class="keywordflow">if</span> (i &amp; 1)
<a name="l00681"></a>00681             splaylnk_link_right_unsafe(pp, pi);
<a name="l00682"></a>00682         <span class="keywordflow">else</span>
<a name="l00683"></a>00683             splaylnk_link_left_unsafe(pp, pi);
<a name="l00684"></a>00684     }
<a name="l00685"></a>00685 }
<a name="l00686"></a>00686 
<a name="l00687"></a>00687 <span class="preprocessor">#ifdef __cplusplus</span>
<a name="l00688"></a>00688 <span class="preprocessor"></span>}
<a name="l00689"></a>00689 <span class="preprocessor">#endif  </span><span class="comment">/* #ifdef __cplusplus */</span>
</pre></div></div>
</div>
<!--- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>全部</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>数据结构</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>文件</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>函数</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>变量</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>类型定义</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>宏定义</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<hr class="footer"/><address class="footer"><small>Generated at 2015年七月16日 星期四 12:00:37 for Navo Portable Library by&#160;
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.3 </small></address>
</body>
</html>
